A Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem

نویسندگان

  • A. M. Fathollahi-Fard Department of Industrial Engineering, University of Science and Technology of Mazandaran, Behshahr, Iran
  • M. Hajiaghaei-Keshteli Department of Industrial Engineering, University of Science and Technology of Mazandaran, Behshahr, Iran
  • R. Tavakkoli-Moghaddam School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran ; Arts et Métiers Paris Tech, LCFC, Metz, France
چکیده مقاله:

Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been developed recently by both academia and health practitioners to consider elderlies’ preferences willing to receive their cares at their homes instead of hospitals or retirement homes. To alleviate the drawbacks of pervious works and make HHC more practical, this paper introduces not only a new mathematical formulation considering new suppositions in this research area but also a solution approach based on Lagrangian relaxation theory has been employed for the first time. The main strategy of used algorithm aims to fill the gap between the lower bound and upper bound of problem and finds a solution which has both optimality and feasibility properties. By generating a number of numerical examples, results show the performance of the proposed algorithm analyzed by different criteria as well as the efficiency of developed formulation through a set of sensitivity analyses.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy ‎Demands‎

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...

متن کامل

A Honey Bee Algorithm To Solve Quadratic Assignment Problem

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

متن کامل

Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem

This paper presents a hybrid approach that aims at solving the Capacitated Vehicle Routing Problem (CVRP) by means of combining Constraint Programming (CP) with Lagrangian Relaxation (LR) and Probabilistic Algorithms. After introducing the CVRP and reviewing the main literature on this area, the paper proposes the use of a multistart hybrid Variable Neighbourhood Search (VNS) algorithm. This al...

متن کامل

a new mathematical model for multi period multi depot home health care routing scheduling problem

background & aim: nowadays, home health care services play significant roles in modern societies. such services allow the elderly and needy people to pass their treatment process at their own houses in a friendly environment. in this paper, weekly routing and scheduling problem of home health care personnel was investigated. methods & materials: insufficient number of expert personnel or overla...

متن کامل

Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem

We consider a single item Production-Inventory-Routing problem with a single producer/supplier and multiple retailers. Inventory management constraints are considered both at the producer and at the retailers, following a vendor managed inventory approach, where the supplier monitors the inventory at retailers and decides on the replenishment policy for each retailer. We assume a constant produ...

متن کامل

Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm

Due to the process of network convergence, the variety of types of traffic transmitted over a single medium increases steeply. This phenomenon can be handled by the existing networking structure although the protocols that are used and, especially, the underlying routing protocols need to be improved. The problem of finding the shortest path on the Internet can no longer be easily defined as th...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 31  شماره 10

صفحات  1734- 1740

تاریخ انتشار 2018-10-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023